Improvement in Coverage Ratio using Overlap Sensing Shifted Node in Grid
نویسندگان
چکیده
منابع مشابه
Enhancement of Data Aggregation Grid based Coverage Ratio using Overlap Sensing Ratio with Awgn Channel in Heterogeneous WSNs
Heterogeneous wireless sensor network (H-WSN) consists of sensor nodes with different ability, such as different computing power and sensing range. In this Research paper, the improved enhance coverage overlapping sensing ratio (I-ECOSR) scheme for data aggregation in grid based WSNs is proposed. Here, the focus was on two main problems i.e. in the area coverage problem, the coverage performanc...
متن کاملPrognostic Value of Lymph Node Ratio in comparison to Lymph Node Metastases in Stage III Colon Cancer
Background & Objectives: Colon cancer is currently of high incidence and mortality rate. Identifying the factors influencing its prognosis can be very beneficial to its clinical treatment. Recent studies have shown that lymph nodes ratio can be considered as an important prognostic factor. The aim of the present study is to investigate the effect of this factor on the prognosis of the ...
متن کاملFast Node Overlap Removal
The problem of node overlap removal is to adjust the layout generated by typical graph drawing methods so that nodes of non-zero width and height do not overlap, yet are as close as possible to their original positions. We give an O(n logn) algorithm for achieving this assuming that the number of nodes overlapping any single node is bounded by some constant. This method has two parts, a constra...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Fast Node Overlap Removal in Graph Layout
Most graph layout algorithms in the field of graph drawing treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height do not overlap, yet are as close as possible to their original positions. We give an O(n logn) algorithm for achieving this assuming that the number of nodes overlapping any single node ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/20859-3556